Computational complexity

Results: 2253



#Item
861Complexity classes / NP / P versus NP problem / Randomized algorithm / PP / Random self-reducibility / RP / P / Normal distribution / Theoretical computer science / Computational complexity theory / Applied mathematics

Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 4 25 March 1999 ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 1999-04-30 15:06:50
862Randomness / Pseudorandomness / Information theory / Computational complexity theory / Pseudorandom number generators / Pseudorandom generator / Leftover hash lemma / Entropy / Fortuna / Theoretical computer science / Applied mathematics / Cryptography

Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions∗ Iftach Haitner† and Omer Reingold‡ and Salil Vadhan§ May 24, 2012 Abstract

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2013-11-27 11:40:21
863Computability theory / Analysis of algorithms / Descriptive complexity / Kolmogorov complexity / Bounded-error probabilistic polynomial / FO / PP / IP / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2013-04-27 00:54:51
864Complexity classes / Circuit complexity / Computational resources / Structural complexity theory / ACC0 / AC / PP / P / NC / Theoretical computer science / Computational complexity theory / Applied mathematics

Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 7 The Permanent Requires Large Uniform Threshold Circuits

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 1999-10-13 17:17:47
865NP-complete problems / Conjunctive normal form / Combinatorics / Boolean satisfiability problem / String / Permutation / PP / 2-satisfiability / MAX-3SAT / Theoretical computer science / Mathematics / Computational complexity theory

Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2000-02-20 22:53:43
866Computational complexity theory / Quantum complexity theory / Quantum cryptography / Communication / Randomized algorithm / Communication complexity / IP / PP / NP / Theoretical computer science / Applied mathematics / Quantum information science

Simultaneous Communication Protocols with Quantum and Classical Messages Dmitry Gavinsky∗ Oded Regev†

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2008-12-29 16:31:47
867Boolean algebra / Complexity classes / Logic in computer science / Binary decision diagram / Model checking / Boolean function / Boolean circuit / Circuit / FO / Theoretical computer science / Mathematics / Computational complexity theory

Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 5 Complexity of Problems on Graphs Represented as OBDDs

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 1999-10-12 16:14:35
868ACM SIGACT / Lance Fortnow / Average-case complexity / Russell Impagliazzo / Decision tree model / Quantum information science / Computer science / Richard Cleve / Complexity / Theoretical computer science / Applied mathematics / Computational complexity theory

Computational Complexity Fifteenth Annual IEEE Conference ADVANCE REGISTRATION FORM

Add to Reading List

Source URL: computationalcomplexity.org

Language: English - Date: 2012-08-02 12:27:54
869Switches / Analysis of algorithms / Scheduling algorithms / Computational complexity theory / Scheduling / Speedup / Time complexity / Graph coloring / Crossbar switch / Theoretical computer science / Applied mathematics / Mathematics

Guaranteed Scheduling for Switches with Configuration Overhead Brian Towles and William J. Dally Abstract— In this paper we present three algorithms that provide performance guarantees for scheduling switches, such as

Add to Reading List

Source URL: cva.stanford.edu

Language: English - Date: 2005-12-01 13:38:04
870Mathematics / FO / Overprint / SO / HO / Finite model theory / Descriptive complexity / Computational complexity theory

BELIZE International Year of the ChildC + L ABEL

Add to Reading List

Source URL: www.stampalbums.com

Language: English - Date: 2014-06-28 09:37:15
UPDATE